منابع مشابه
H R C C *
Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...
متن کاملReductive Coupling of H - H , H - C , and C - C Bonds from Pd Complexes
Reductive coupling to form H-H, C-H, and C-C bonds from transition-metal complexes is of fundamental importance in many catalytic processes. However, despite numerous experimental' and theoretical2 studies, there remain a number of puzzles concerning these processes. For example, reductive elimination of methane from Pt(H)(CH3)(PPh3), is quite facile at -25 'C,ld while Pt(CH3)2(PPh,)2 is qkite ...
متن کاملPolytopic best-mean H ∞ performance analysis
In [1], a novel best-mean approach to robust analysis and control over uncertain-parameters boxes was presented. This paper extends the results of [1] to convex uncertainty polytopes of arbitrary shape and arbitrary number of vertices, without an underlying parameters model. The paper addresses robust, polytopic, probabilistic H∞ analysis of linear systems and focuses on the performance distrib...
متن کاملAdiabatic TOCSY for C,C and H,H J-transfer.
Adiabatic pulses have been widely used for broadband decoupling and spin inversion at high magnetic fields. In this paper we propose adiabatic pulses and supercycles that can be used at high magnetic fields like 800 or 900 MHz to obtain broadband TOCSY sequences with C,C or H,H J-transfer. The new mixing sequences are equal or even superior to the well known DIPSI-2,3 experiments with respect t...
متن کاملOptimal Triangulations for the Best C 1
In this paper, we are concerned with the problem of constructing triangulations which are optimal in the sense that the space of C 1 piecewise quartic polynomial functions on such triangulations admits the optimal ((fth) order of approximation. x1 Introduction Deenition 1.1. A collection = f i g N i=1 of triangles i in l R 2 is called a triangulation, if (i) the union := N S i=1 i is a connecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1978
ISSN: 0028-0836,1476-4687
DOI: 10.1038/274099a0